Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3JTACQ8
Repositorysid.inpe.br/sibgrapi/2015/07.23.22.13
Last Update2015:07.23.22.13.54 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2015/07.23.22.13.54
Metadata Last Update2022:05.18.22.21.00 (UTC) administrator
Citation KeyNascimentoCarvAndr:2015:ExClAl
TitleExploring Clustering Algorithms in the Appearance Modeling Problem
FormatOn-line
Year2015
Access Date2024, Apr. 28
Number of Files1
Size1058 KiB
2. Context
Author1 Nascimento, Fernando Melo
2 Carvalho, André Britto de
3 Andrade, Beatriz Trinchão
Affiliation1 Universidade Federal de Sergipe
2 Universidade Federal de Sergipe
3 Universidade Federal de Sergipe
EditorVieira, Thales Miranda de Almeida
Mello, Vinicius Moreira
e-Mail Addressnascimentofm@ufs.br
Conference NameConference on Graphics, Patterns and Images, 28 (SIBGRAPI)
Conference LocationSalvador, BA, Brazil
Date26-29 Aug. 2015
PublisherSociedade Brasileira de Computação
Publisher CityPorto Alegre
Book TitleProceedings
Tertiary TypeUndergraduate Work
History (UTC)2015-07-23 22:13:54 :: nascimentofm@ufs.br -> administrator ::
2022-05-18 22:21:00 :: administrator -> :: 2015
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
KeywordsBRDF
clustering
appearance modeling
genetic algorithm
NNLS
linear combination
AbstractModeling the appearance of a given material is a complex task with many approaches in the literature. One is to measure the BRDF of the material, which is time and resource consuming. One alternative is to use a linear combination of an existent BRDF-basis to approximate the material's appearance. However, the renderization of many BRDF-basis is also consuming, which could be eased by selecting a subset of the materials and use them as basis. Clustering algorithms can perform this task, by grouping BRDFs in clusters, where just one BRDF can represent one entire cluster. We use two classical and one evolutionary clustering algorithms to reduce the number of terms in the linear combination and a NNLS procedure to estimate the contributions of each BRDF-base in the reproduction of a desired material.
Arrangementurlib.net > SDLA > Fonds > SIBGRAPI 2015 > Exploring Clustering Algorithms...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 23/07/2015 19:13 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3JTACQ8
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3JTACQ8
Languageen
Target FileExploring Clustering Algorithms in the Appearance Modeling Problem.pdf
User Groupadministrator
nascimentofm@ufs.br
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPBW34M/3K24PF8
Citing Item Listsid.inpe.br/sibgrapi/2015/08.03.22.49 8
sid.inpe.br/banon/2001/03.30.15.38.24 1
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume


Close